Random codes: minimum distances and error exponents
نویسندگان
چکیده
منابع مشابه
Random codes: Minimum distances and error exponents
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon’s random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length and rate is shown to have minimum distance (2 ), where ( ) is the Gilbert–Varshamov (GV) relative distance at rate , whereas a typical linear co...
متن کاملError exponents of typical random codes
We define the error exponent of the typical random code as the long–block limit of the negative normalized expectation of the logarithm of the error probability of the random code, as opposed to the traditional random coding error exponent, which is the limit of the negative normalized logarithm of the expectation of the error probability. For the ensemble of uniformly randomly drawn fixed comp...
متن کاملMinimum Distances of Error-correcting Codes in Incidence Rings
It is very well known that additional algebraic structure can give advantages for coding applications. For example, all cyclic error-correcting codes are principal ideals in the group algebras of cyclic groups (see the survey [4] and the books [3, 5, 6, 7]). Serious attention in the literature has been devoted to considering properties of ideals in various ring constructions essential from the ...
متن کاملOn Random Coding Error Exponents of Watermarking Codes
steganography, watermarking, information hiding, error exponent, random coding Watermarking codes are analyzed from an informationtheoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message (typically, text, image, sound, or video stream) within a certain distortion level, the attacker ...
متن کاملError Exponents of Expander Codes
We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and channel capacity. The decoding complexity grows linearly with code length.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/tit.2002.800480